- augmented arithmetic
- мат.пополненная арифметика
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Augmented assignment — (or compound assignment) is the name given to certain operators in certain programming languages (especially those derived from C). An augmented assignment is generally used to replace a statement where an operator takes a variable as one of its… … Wikipedia
Presburger arithmetic — is the first order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who published it in 1929. It is not as powerful as Peano arithmetic because it omits multiplication.OverviewThe language of Presburger… … Wikipedia
Automatic differentiation — In mathematics and computer algebra, automatic differentiation, or AD, sometimes alternatively called algorithmic differentiation, is a method to numerically evaluate the derivative of a function specified by a computer program. Two classical… … Wikipedia
Pitch interval — Augmented second on C. In musical set theory, a pitch interval (PI or ip) is the number of semitones that separates one pitch from another, upward or downward[1]. They are notated as follows … Wikipedia
List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A … Wikipedia
education — /ej oo kay sheuhn/, n. 1. the act or process of imparting or acquiring general knowledge, developing the powers of reasoning and judgment, and generally of preparing oneself or others intellectually for mature life. 2. the act or process of… … Universalium
C (programming language) — C The C Programming Language[1] (aka K R ) is the seminal book on C … Wikipedia
Peano axioms — In mathematical logic, the Peano axioms, also known as the Dedekind Peano axioms or the Peano postulates, are a set of axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano. These axioms have been used… … Wikipedia
Zermelo–Fraenkel set theory — Zermelo–Fraenkel set theory, with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics.ZFC consists of a single primitive ontological notion, that of… … Wikipedia
Counter machine — A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the four types of register machines. A counter machine comprises a set of one or more unbounded… … Wikipedia
Ordinal analysis — In proof theory, ordinal analysis assigns ordinals (often large countable ordinals) to mathematical theories as a measure of their strength. The field was formed when Gerhard Gentzen in 1934 used cut elimination to prove, in modern terms, that… … Wikipedia